Under military war weapon support the economic bond level estimation using generalized Petersen graph with imputation

نویسندگان

چکیده

Several countries of the world are involved in mutual and collaborative business military equipments, weapons terms their production, sales, technical maintenance, training services. As a consequence, manufacturing boms, rockets, missiles other ammunitions have taken structured smooth shape to help others where when needed. Often support among remain open for information media, but sometime secret due national security international political pressure. Such phenomenon (hidden or ) is part supply chain could be modeled like Petersen graph considering vertices as edges economic bonds. For large graphical structure, without sampling, it difficult find out average bonding (open & secret) between any pair support. This paper presents sample based estimation methodology estimating mean bond value business. Motivation problem derived from current Russia-Ukraine war situation kind hidden by NATO countries. A node sampling procedure proposed whose bias, mean-squared error properties derived. Results supported with empirical studies. Findings compared particular cases confidence intervals used basic tool comparison. Pattern imputation together new proposal CIImputation method who has been proved useful filling missing value, specially data found missing. The undergoing Ukraine Russia weapon, an application contained this paper. Key words: Graph, Estimator, Bias, Mean Squared Error (MSE), Optimum Choice, Confidence (CI), Nodes (vertices), Imputation, CI-Imputation (LLimputation UL-imputation), Economic Bonds, Military War, Weapon Support

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-level Distance Labelings for Generalized Petersen Graph

1 Department of Mathematics, Lahore College for Women University, Lahore-Pakistan E-mail: [email protected] 2 Department of Mathematics, Lahore College for Women University, Lahore-Pakistan E-mail: [email protected] 3* Division of Science and Technology, University of Education, Township Lahore-Pakistan E-mail: [email protected] ABSTRACT: Let G be a connected graph with diameter...

متن کامل

SIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL

Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.

متن کامل

The Tutte polynomial and the generalized Petersen graph

GraphsG andH are T -equivalent if they have the same Tutte polynomial. G is T -unique if any arbitrary graph H being T -equivalent to G implies that H is isomorphic to G. We show that the generalized Petersen graph P (m, 2) and the line graph of P (m, 2) are T -unique. 1 The Tutte Polynomial Let G be a graph with vertex set V and edge set E, and let G[A] denote the subgraph ofG induced by the e...

متن کامل

On the Total Irregularity Strength of Generalized Petersen Graph

As a standard notation, assume that G = G(V,E) is a finite, simple and undirected graph with p vertices and q edges. A labeling of a graph is any mapping that sends some set of graph elements to a set of numbers (usually positive integers). If the domain is the vertex-set or the edge-set, the labelings are called respectively vertex-labelings or edge-labelings. If the domain is V ∪E then we cal...

متن کامل

Addressing the Petersen graph

Motivated by a problem on message routing in communication networks, Graham and Pollak proposed a scheme for addressing the vertices of a graph G by N -tuples of three symbols in such a way that distances between vertices may readily be determined from their addresses. They observed that N ≥ h(D), the maximum of the number of positive and the number of negative eigenvalues of the distance matri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistics in Transition New Series

سال: 2023

ISSN: ['1234-7655', '2450-0291']

DOI: https://doi.org/10.59170/stattrans-2023-016